Applications to network analysis: Graph partitioning and community detection Lecture notes
نویسنده
چکیده
• Denote by |S| its cardinality (that is, the number of its elements), by S̄ its complement (that is, S̄ = V \ S) and by 1S its characteristic vector, that is (1S)i = 1 if i ∈ S and 0 otherwise. • Let volS = ∑ i∈S di be the volume of S (recall that di is the degree of node i). Note: volS = d1S . • Let ein(S) = 1SA1S and eout(S) = 1SA(1 − 1S) = volS − ein(S). Note: eout(S) is the number of edges joining S with S̄ while ein(S) is twice the number of edges whose endpoints are both in S.
منابع مشابه
Detecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملOverlapping Community Detection in Social Networks Based on Stochastic Simulation
Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...
متن کاملUsing graph partitioning for efficient network modularity optimization
The paper reviews an approach for finding the communities of a network developed by the authors [WAW’06, Lecture Notes in Computer Science, Volume 4936/2008, 117-128, IEEE TPDS vol. PP, issue 99, 2012], which is based on a reduction of the modularity optimization problem to the minimum weighted cut problem, and gives an experimental evaluation of an implementation based on that approach on grap...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملA Heuristic Algorithm for Bipartite Community Detection in Social Networks
Analysis on topological characteristics of the network, such as the vertex degree distribution, centrality and community structure, provides valuable insight into the structure and function of the interacting data entities. Community detection is one of the key problems in the field of social network analysis. In the paper, we mainly focus on the two-part division problem for network, i.e., com...
متن کامل